Nested quantum search and structured problems
نویسندگان
چکیده
Nicolas J. Cerf, Lov K. Grover, and Colin P. Williams W. K. Kellogg Radiation Laboratory, California Institute of Technology, Pasadena, California 91125 Information and Computing Technologies Research Section, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, California 91109 Ecole Polytechnique, Code Postale 165, Université Libre de Bruxelles, 1050 Brussels, Belgium 3C-404A Bell Laboratories, 600 Mountain Avenue, Murray Hill, New Jersey 07974 ~Received 31 July 1998; revised manuscript received 21 October 1999; published 9 February 2000!
منابع مشابه
Non - nested and non - structured multigrid methods applied to elastic problems . Part II : The three - dimensional case
Aspects of non-nested and non-structured multigrid methods with applications to twodimensional elastic problems were presented in a companion paper [5] by the current authors, Non-Nested and Non-Structured Multigrid Methods Applied to Elastic Problems, Part I: The Two-Dimensional Case. In this paper a review of some multigrid strategies, procedures for geometric search to implement transfer ope...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملAdiabatic quantum search algorithm for structured problems
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover’s algorithm. In this paper, we study how the structure of the search...
متن کاملQuantum Searching: A survey of Grover’s Algorithm and its Descendants
One of computer science’s classic problems is that of the search. This paper will look at Lou K. Grover’s Quantum Search algorithm. This algorithm is used to search a database, or search space, that is not, and cannot be, sorted or structured. It can produce a quadratic speed up over any similar classical search. This paper will also look at some of the issues and advances that have come out of...
متن کاملQuantum Search on Structured Problems
This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root-a simple minded search that takes steps, can be improved to approximately steps. The quantum search algorithm is one of several immediate consequences of this framework. Sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000